Buffer Overflow Period in a Constant Service Rate Queue
نویسنده
چکیده
– When we speak about the buffer overflow period we mean the time interval in which the queue size is equal to the capacity of the buffer. Thus packets or cells arriving during this period are lost. The distribution of the length of this interval is recently gaining attention as a very informative characteristic of the queueing performance. In this paper the numerous results related to the distribution of the buffer overflow period in a constant service time queue are presented. In particular, they include formulas for distribution functions, probability density functions, expected values, limiting distributions for a large buffer. The queueing models supporting single and batch arrivals are considered. Key-Words: – performance evaluation, queueing systems, buffer overflow
منابع مشابه
Buffer overflow asymptotics for multiplexed regulated traffic
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the many-sources regime for the tail distribution of the workload generated by these flows in a FIFO queue with constant service rate. Furthermore, we compare this workload distribution with an M/G/1 queue ...
متن کاملAsymptotic Loss Probability in a Finite Buffer Fluid Queue with Heterogeneous
Consider a fluid queue with a finite buffer B and capacity c fed by a superposition of N independent On–Off processes. An On–Off process consists of a sequence of alternating independent periods of activity and silence. Successive periods of activity, as well as silence, are identically distributed. The process is active with probability p and during its activity period produces fluid at consta...
متن کاملImportance Sampling for Weighted-Serve-the-Longest-Queue
This paper considers buffer overflow probabilities for stable queueing systems with one server and different classes of arrivals. The service priority is given to the class of customers whose current weighted queue size is the largest (weighted-serve-the-longest-queue policy). We explicitly identify the exponential decay rate for the rare-event probabilities of interest, and construct asymptoti...
متن کاملBuffer overflow period in a batch-arrival queue with autocorrelated arrivals
In this paper a study on the buffer overflow period in a finite-buffer queue is presented. A special attention is paid to the autocorrelation and batch arrivals, which are supposed to mimic the properties of real arrival processes. Using the batch Markovian arrival process, formulas for the duration of the first, subsequent and stationary overflow periods, as well as formulas for the distributi...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کامل